On TC0 Lower Bounds for the Permanent
نویسنده
چکیده
In this paper we consider the problem of proving lower bounds for the permanent. An ongoing line of research has shown super-polynomial lower bounds for slightly-non-uniform small-depth threshold and arithmetic circuits [All99, KP09, JS11, JS12]. We prove a new parameterized lower bound that includes each of the previous results as sub-cases. Our main result implies that the permanent does not have Boolean threshold circuits of the following kinds. 1. Depth O(1), poly-log(n) bits of non-uniformity, and size s(n) such that for all constants c, s(n) < 2. The size s must satisfy another technical condition that is true of functions normally dealt with (such as compositions of polynomials, logarithms, and exponentials). 2. Depth o(log log n), poly-log(n) bits of non-uniformity, and size n. 3. Depth O(1), n bits of non-uniformity, and size n. Our proof yields a new “either or” hardness result. One instantiation is that either NP does not have polynomial-size constant-depth threshold circuits that use n bits of non-uniformity, or the permanent does not have polynomial-size general circuits.
منابع مشابه
The Permanent Requires Large
A recent paper by Caussinus, McKenzie, Th erien, and Vollmer [CMTV96] shows that there are problems in the counting hierarchy that require superpolynomial-size uniform TC0 circuits. The proof in [CMTV96] uses \leaf languages" as a tool in obtaining their separations, and their proof does not immediately yield larger lower bounds for the complexity of these problems, and it also does not yield a...
متن کاملOn Tc 0 , Ac 0 , and Arithmetic Circuits 1
Continuing a line of investigation that has studied the function classes #P [Val79b], #SAC1 [Val79a, Vin91, AJMV], #L [AJ93b, Vin91, AO94], and #NC1 [CMTV96], we study the class of functions #AC0. One way to de ne #AC0 is as the class of functions computed by constant-depth polynomial-size arithmetic circuits of unbounded fan-in addition and multiplication gates. In contrast to the preceding fu...
متن کاملOn TC0, AC0, and Arithmetic Circuits
Continuing a line of investigation that has studied the function classes #P [Val79b], #SAC1 [Val79a, Vin91, AJMV], #L [AJ93b, Vin91, AO94], and #NC1 [CMTV96], we study the class of functions #AC0. One way to define #AC0 is as the class of functions computed by constantdepth polynomial-size arithmetic circuits of unbounded fanin addition and multiplication gates. In contrast to the preceding fun...
متن کاملOn Interpolation and Automatization for Frege
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this pap...
متن کامل